Electronic jury voting protocolsHEVIA, Alejandro; KIWI, Marcos.Lecture notes in computer science. 2002, pp 415-429, issn 0302-9743, isbn 3-540-43400-3Conference Paper

The provable security of graph-based one-time signatures and extensions to algebraic signature schemesHEVIA, Alejandro; MICCIANCIO, Daniele.Lecture notes in computer science. 2002, pp 379-396, issn 0302-9743, isbn 3-540-00171-9, 18 p.Conference Paper

Universally composable simultaneous broadcastHEVIA, Alejandro.Lecture notes in computer science. 2006, pp 18-33, issn 0302-9743, isbn 3-540-38080-9, 1Vol, 16 p.Conference Paper

Matching based augmentations for approximating connectivity problemsRAVI, R.Lecture notes in computer science. 2006, pp 13-24, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

A 4-approximation algorithm for guarding 1.5-dimensional terrainsKING, James.Lecture notes in computer science. 2006, pp 629-640, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Efficient approximate dictionary look-up for long words over small alphabetsARSLAN, Abdullah N.Lecture notes in computer science. 2006, pp 118-129, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Exponential lower bounds on the space complexity of OBDD-Based graph algorithmsSAWITZKI, Daniel.Lecture notes in computer science. 2006, pp 781-792, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

RNA molecules : Glimpses through an algorithmic lensCONDON, Anne.Lecture notes in computer science. 2006, pp 8-10, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 3 p.Conference Paper

Algorithmic challenges in web search enginesBAEZA-YATES, Ricardo.Lecture notes in computer science. 2006, pp 1-7, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 7 p.Conference Paper

C-varieties, actions and wreath productCHAUBARD, Laura.Lecture notes in computer science. 2006, pp 274-285, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

The branch-width of circular-arc graphsMAZOIT, Frédéric.Lecture notes in computer science. 2006, pp 727-736, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 10 p.Conference Paper

Modelling errors and recovery for communicationSUDAN, Madhu.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32755-X, 1Vol, p. 25Conference Paper

A faster algorithm for finding maximum independent sets in sparse graphsFURER, Martin.Lecture notes in computer science. 2006, pp 491-501, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 11 p.Conference Paper

A practice-oriented treatment of Pseudorandom Number GeneratorsDESAI, Anand; HEVIA, Alejandro; YIQUN LISA YIN et al.Lecture notes in computer science. 2002, pp 368-383, issn 0302-9743, isbn 3-540-43553-0Conference Paper

Algorithms for modular counting of roots of multivariate polynomialsGOPALAN, Parikshit; GURUSWAM, Venkatesan; LIPTON, Richard J et al.Lecture notes in computer science. 2006, pp 544-555, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

An efficient approximation algorithm for point pattern matching under noiseCHOI, Vicky; GOYAL, Navin.Lecture notes in computer science. 2006, pp 298-310, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 13 p.Conference Paper

An optimal algorithm for the continuous/discrete weighted 2-center problem in treesBEN-MOSHE, Boaz; BHATTACHARYA, Binay; QIAOSHENG SHI et al.Lecture notes in computer science. 2006, pp 166-177, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Design and analysis of online batching systemsHUNG, Regant Y. S; TING, Hing-Fung.Lecture notes in computer science. 2006, pp 605-616, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Maximizing throughput in queueing networks with limited flexibilityDOWN, Douglas G; KARAKOSTAS, George.Lecture notes in computer science. 2006, pp 398-409, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Pattern matching statistics on correlated sourcesBOURDON, Jérémie; VALLEE, Brigitte.Lecture notes in computer science. 2006, pp 224-237, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 14 p.Conference Paper

Reconfigurations in graphs and gridsCALINESCU, Gruia; DUMITRESCU, Adrian; PACH, Janos et al.Lecture notes in computer science. 2006, pp 262-273, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Speeding up approximation algorithms for NP-hard spanning forest problems by multi-objective optimizationNEUMANN, Frank; LAUMANNS, Marco.Lecture notes in computer science. 2006, pp 745-756, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Hardness amplification via space-efficient direct productsGURUSWAMI, Venkatesan; KABANETS, Valentine.Lecture notes in computer science. 2006, pp 556-568, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 13 p.Conference Paper

Lower bounds for geometric diameter problemsFOURNIER, Hervé; VIGNERON, Antoine.Lecture notes in computer science. 2006, pp 467-478, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Network flow spannersDRAGAN, Feodor F; CHENYU YAN.Lecture notes in computer science. 2006, pp 410-422, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 13 p.Conference Paper